Region Growing Euclidean Distance Transforms
نویسنده
چکیده
By propagating a vector for each pixel, we show that nearly Euclidean distance maps can be produced quickly by a region growing algorithm using hierarchical queues. Properties of the propagation scheme are used to detect potentially erroneous pixels and correct them by using larger neighbourhoods, without significantly affecting the computation time. Thus, Euclidean distance maps are produced in a time comparable to its commonly used chamfer approximations.
منابع مشابه
Applications of the Region Growing Euclidean Distance Transform: Anisotropy and Skeletons
A new region growing algorithm has recently been proposed for computing Euclidean Distance Maps in a time comparable to widely used chamfer DT. In this paper we show how this algorithm can be extended to more complex tasks such as the computation of distance maps on an-isotropic grids and the generation of a new type of Euclidean skeletons.
متن کاملDistance transforms: Academics versus industry
In image and video analysis, distance transformations (DT) are frequently used. They provide a distance image (DI) of background pixels to the nearest object pixel. DT touches upon the core of many applications; consequently, not only science but also industry has conducted a significant body of work in this field. However, in a vast majority of the cases this has not been published in major sc...
متن کاملA Micropower Current-Mode Euclidean Distance Calculator for Pattern Recognition
In this paper a new synthesis for circuit design of Euclidean distance calculation is presented. The circuit is implemented based on a simple two-quadrant squarer/divider block. The circuit that employs floating gate MOS (FG-MOS) transistors operating in weak inversion region, features low circuit complexity, low power (<20uW), low supply voltage (0.5V), two quadrant input current, wide dyn...
متن کاملNew sequential exact Euclidean distance transform algorithms based on convex analysis
We present several sequential exact Euclidean distance transform algorithms. The algorithms are based on fundamental transforms of convex analysis: The Legendre Conjugate or Legendre–Fenchel transform, and the Moreau envelope or Moreau-Yosida approximate. They combine the separability of the Euclidean distance with convex properties to achieve an optimal linear-time complexity. We compare them ...
متن کاملFast raster scan distance propagation on the discrete rectangular lattice
The main result of this paper is that simple (raster scan) sequential algorithms for computing Euclidean Distance Transforms can be implemented in an optimized manner from the point of view of numerical computations. We will show that these fast implementations have computational complexities comparable to the city block, chessboard and other simple chamfer Distance Transforms.
متن کامل